PC World Komputer 2010 April/PCWorld0410.iso/hity wydania/Ubuntu 9.10 PL/karmelkowy-koliberek-desktop-9.10-i386-PL.iso/casper/filesystem.squashfs/usr/lib/python2.6/csv.pyc

Python Compiled Bytecode | 2009-11-11 | 13KB | 435 lines

# Source Generated with Decompyle++
# File: in.pyc (Python 2.6)

'''
csv.py - read/write/investigate CSV files
'''
import re
from functools import reduce
from _csv import Error, __version__, writer, reader, register_dialect, unregister_dialect, get_dialect, list_dialects, field_size_limit, QUOTE_MINIMAL, QUOTE_ALL, QUOTE_NONNUMERIC, QUOTE_NONE, __doc__
from _csv import Dialect as _Dialect

try:
    from cStringIO import StringIO
except ImportError:
    from StringIO import StringIO

__all__ = [
    'QUOTE_MINIMAL',
    'QUOTE_ALL',
    'QUOTE_NONNUMERIC',
    'QUOTE_NONE',
    'Error',
    'Dialect',
    '__doc__',
    'excel',
    'excel_tab',
    'field_size_limit',
    'reader',
    'writer',
    'register_dialect',
    'get_dialect',
    'list_dialects',
    'Sniffer',
    'unregister_dialect',
    '__version__',
    'DictReader',
    'DictWriter']

class Dialect:
    '''Describe an Excel dialect.

    This must be subclassed (see csv.excel).  Valid attributes are:
    delimiter, quotechar, escapechar, doublequote, skipinitialspace,
    lineterminator, quoting.

    '''
    _name = ''
    _valid = False
    delimiter = None
    quotechar = None
    escapechar = None
    doublequote = None
    skipinitialspace = None
    lineterminator = None
    quoting = None

    def __init__(self):
        if self.__class__ != Dialect:
            self._valid = True

        self._validate()


    def _validate(self):

        try:
            _Dialect(self)
        except TypeError:
            e = None
            raise Error(str(e))




class excel(Dialect):
    '''Describe the usual properties of Excel-generated CSV files.'''
    delimiter = ','
    quotechar = '"'
    doublequote = True
    skipinitialspace = False
    lineterminator = '\r\n'
    quoting = QUOTE_MINIMAL

register_dialect('excel', excel)

class excel_tab(excel):
    '''Describe the usual properties of Excel-generated TAB-delimited files.'''
    delimiter = '\t'

register_dialect('excel-tab', excel_tab)

class DictReader:

    def __init__(self, f, fieldnames = None, restkey = None, restval = None, dialect = 'excel', *args, **kwds):
        self._fieldnames = fieldnames
        self.restkey = restkey
        self.restval = restval
        self.reader = reader(f, dialect, *args, **kwds)
        self.dialect = dialect
        self.line_num = 0


    def __iter__(self):
        return self


    def fieldnames(self):
        if self._fieldnames is None:

            try:
                self._fieldnames = self.reader.next()
            except StopIteration:
                pass
            except:
                None<EXCEPTION MATCH>StopIteration


        None<EXCEPTION MATCH>StopIteration
        self.line_num = self.reader.line_num
        return self._fieldnames

    fieldnames = property(fieldnames)

    def fieldnames(self, value):
        self._fieldnames = value

    fieldnames = fieldnames.setter(fieldnames)

    def next(self):
        if self.line_num == 0:
            self.fieldnames

        row = self.reader.next()
        self.line_num = self.reader.line_num
        while row == []:
            row = self.reader.next()
        d = dict(zip(self.fieldnames, row))
        lf = len(self.fieldnames)
        lr = len(row)
        if lf < lr:
            d[self.restkey] = row[lf:]
        elif lf > lr:
            for key in self.fieldnames[lr:]:
                d[key] = self.restval


        return d



class DictWriter:

    def __init__(self, f, fieldnames, restval = '', extrasaction = 'raise', dialect = 'excel', *args, **kwds):
        self.fieldnames = fieldnames
        self.restval = restval
        if extrasaction.lower() not in ('raise', 'ignore'):
            raise ValueError, "extrasaction (%s) must be 'raise' or 'ignore'" % extrasaction
        extrasaction.lower() not in ('raise', 'ignore')
        self.extrasaction = extrasaction
        self.writer = writer(f, dialect, *args, **kwds)


    def _dict_to_list(self, rowdict):
        return [ rowdict.get(key, self.restval) for key in self.fieldnames ]


    def writerow(self, rowdict):
        return self.writer.writerow(self._dict_to_list(rowdict))


    def writerows(self, rowdicts):
        rows = []
        for rowdict in rowdicts:
            rows.append(self._dict_to_list(rowdict))

        return self.writer.writerows(rows)



try:
    complex
except NameError:
    complex = float


class Sniffer:
    '''
    "Sniffs" the format of a CSV file (i.e. delimiter, quotechar)
    Returns a Dialect object.
    '''

    def __init__(self):
        self.preferred = [
            ',',
            '\t',
            ';',
            ' ',
            ':']


    def sniff(self, sample, delimiters = None):
        '''
        Returns a dialect (or None) corresponding to the sample
        '''
        (quotechar, delimiter, skipinitialspace) = self._guess_quote_and_delimiter(sample, delimiters)
        if not delimiter:
            (delimiter, skipinitialspace) = self._guess_delimiter(sample, delimiters)

        if not delimiter:
            raise Error, 'Could not determine delimiter'
        delimiter

        class dialect(Dialect):
            _name = 'sniffed'
            lineterminator = '\r\n'
            quoting = QUOTE_MINIMAL
            doublequote = False

        dialect.delimiter = delimiter
        if not quotechar:
            pass
        dialect.quotechar = '"'
        dialect.skipinitialspace = skipinitialspace
        return dialect


    def _guess_quote_and_delimiter(self, data, delimiters):
        """
        Looks for text enclosed between two identical quotes
        (the probable quotechar) which are preceded and followed
        by the same character (the probable delimiter).
        For example:
                         ,'some text',
        The quote with the most wins, same with the delimiter.
        If there is no quotechar the delimiter can't be determined
        this way.
        """
        matches = []
        for restr in ('(?P<delim>[^\\w\n"\'])(?P<space> ?)(?P<quote>["\']).*?(?P=quote)(?P=delim)', '(?:^|\n)(?P<quote>["\']).*?(?P=quote)(?P<delim>[^\\w\n"\'])(?P<space> ?)', '(?P<delim>>[^\\w\n"\'])(?P<space> ?)(?P<quote>["\']).*?(?P=quote)(?:$|\n)', '(?:^|\n)(?P<quote>["\']).*?(?P=quote)(?:$|\n)'):
            regexp = re.compile(restr, re.DOTALL | re.MULTILINE)
            matches = regexp.findall(data)
            if matches:
                break
                continue

        if not matches:
            return ('', None, 0)
        quotes = { }
        delims = { }
        spaces = 0
        for m in matches:
            n = regexp.groupindex['quote'] - 1
            key = m[n]
            if key:
                quotes[key] = quotes.get(key, 0) + 1


            try:
                n = regexp.groupindex['delim'] - 1
                key = m[n]
            except KeyError:
                continue

            if key:
                if delimiters is None or key in delimiters:
                    delims[key] = delims.get(key, 0) + 1


            try:
                n = regexp.groupindex['space'] - 1
            except KeyError:
                continue

            if m[n]:
                spaces += 1
                continue

        quotechar = reduce((lambda a, b, quotes = quotes: if not quotes[a] > quotes[b] or a:
passb), quotes.keys())
        if delims:
            delim = reduce((lambda a, b, delims = delims: if not delims[a] > delims[b] or a:
passb), delims.keys())
            skipinitialspace = delims[delim] == spaces
            if delim == '\n':
                delim = ''

        else:
            delim = ''
            skipinitialspace = 0
        return (quotechar, delim, skipinitialspace)


    def _guess_delimiter(self, data, delimiters):
        """
        The delimiter /should/ occur the same number of times on
        each row. However, due to malformed data, it may not. We don't want
        an all or nothing approach, so we allow for small variations in this
        number.
          1) build a table of the frequency of each character on every line.
          2) build a table of freqencies of this frequency (meta-frequency?),
             e.g.  'x occurred 5 times in 10 rows, 6 times in 1000 rows,
             7 times in 2 rows'
          3) use the mode of the meta-frequency to determine the /expected/
             frequency for that character
          4) find out how often the character actually meets that goal
          5) the character that best meets its goal is the delimiter
        For performance reasons, the data is evaluated in chunks, so it can
        try and evaluate the smallest portion of the data possible, evaluating
        additional chunks as necessary.
        """
        data = filter(None, data.split('\n'))
        ascii = [ chr(c) for c in range(127) ]
        chunkLength = min(10, len(data))
        iteration = 0
        charFrequency = { }
        modes = { }
        delims = { }
        start = 0
        end = min(chunkLength, len(data))
        while start < len(data):
            iteration += 1
            for line in data[start:end]:
                for char in ascii:
                    metaFrequency = charFrequency.get(char, { })
                    freq = line.count(char)
                    metaFrequency[freq] = metaFrequency.get(freq, 0) + 1
                    charFrequency[char] = metaFrequency


            for char in charFrequency.keys():
                items = charFrequency[char].items()
                if len(items) > 1:
                    modes[char] = reduce((lambda a, b: if not a[1] > b[1] or a:
passb), items)
                    items.remove(modes[char])
                    modes[char] = (modes[char][0], modes[char][1] - reduce((lambda a, b: (0, a[1] + b[1])), items)[1])
                    continue
                None if len(items) == 1 and items[0][0] == 0 else []
                modes[char] = items[0]

            modeList = modes.items()
            total = float(chunkLength * iteration)
            consistency = 1
            threshold = 0.9
            while len(delims) == 0 and consistency >= threshold:
                for k, v in modeList:
                    if v[0] > 0 and v[1] > 0:
                        if v[1] / total >= consistency:
                            pass
                        None if delimiters is None or k in delimiters else k in delimiters
                        continue

                consistency -= 0.01
            if len(delims) == 1:
                delim = delims.keys()[0]
                skipinitialspace = data[0].count(delim) == data[0].count('%c ' % delim)
                return (delim, skipinitialspace)
            start = end
            end += chunkLength
            continue
            len(delims) == 1
        if not delims:
            return ('', 0)
        items = [ (v, k) for k, v in delims.items() ]
        items.sort()
        delim = items[-1][1]
        skipinitialspace = data[0].count(delim) == data[0].count('%c ' % delim)
        return (delim, skipinitialspace)


    def has_header(self, sample):
        rdr = reader(StringIO(sample), self.sniff(sample))
        header = rdr.next()
        columns = len(header)
        columnTypes = { }
        for i in range(columns):
            columnTypes[i] = None

        checked = 0
        for row in rdr:
            if checked > 20:
                break

            checked += 1
            if len(row) != columns:
                continue

            for col in columnTypes.keys():
                for thisType in [
                    int,
                    long,
                    float,
                    complex]:

                    try:
                        thisType(row[col])
                    continue
                    except (ValueError, OverflowError):
                        continue


                else:
                    thisType = len(row[col])
                if thisType == long:
                    thisType = int

                if thisType != columnTypes[col]:
                    if columnTypes[col] is None:
                        columnTypes[col] = thisType
                    else:
                        del columnTypes[col]
                columnTypes[col] is None


        hasHeader = 0
        for col, colType in columnTypes.items():
            if type(colType) == type(0):
                if len(header[col]) != colType:
                    hasHeader += 1
                else:
                    hasHeader -= 1
            len(header[col]) != colType

            try:
                colType(header[col])
            except (ValueError, TypeError):
                hasHeader += 1
                continue

            hasHeader -= 1

        return hasHeader > 0